Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP
نویسندگان
چکیده
We construct the first constant time value approximation schemes (CTASs) for Metric and Quasi-Metric MAX-rCSP problems for any r ≥ 2 in a preprocessed metric model of computation, improving over the previous results of [FKKV05] proven for the general core-dense MAX-rCSP problems. They entail also the first sublinear approximation schemes for constructing approximate solutions of the above optimization problems.
منابع مشابه
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satis ed constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and so is NP-hard in general. It is natural to study how ...
متن کاملSub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse
It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS 99), that Max-CUT admits a PTAS on dense graphs, and more generally, Max-k-CSP admits a PTAS on “dense” instances with Ω(n) constraints. In this paper we extend and generalize their exhaustive sampling approach, presenting a framework for (1−ε)-approximating any Max-k-CSP problem in sub-exponential time while si...
متن کاملAn Improvement to an Approximation Algorithm for Max k-CSP(d) REU Report
In this technical report, we present a slight improvement to an algorithm for the Max k-CSP(d) problem, the maximum constraint satisfaction problem with at most k variables in a clause and a domain of size d. The base of the algorithm is that of Makarychev and Makarychev [4]. As noted in their paper, their algorithm is efficient in the domain where k ≥ Ω(log d). Here we present an approach that...
متن کاملHard constraint satisfaction problems have hard gaps at location 1 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satis ed constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed cons...
متن کاملApproximation Algorithm for the Max k-CSP Problem
We present a ck 2k approximation algorithm for the Max k-CSP problem (where c > 0.44 is an absolute constant). This result improves the previously best known algorithm by Hast, which has an approximation guarantee of Ω( k 2k log k ). Our approximation guarantee matches the upper bound of Samorodnitsky and Trevisan up to a constant factor (their result assumes the Unique Games Conjecture).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006